Decycling numbers of random regular graphs
نویسندگان
چکیده
The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the decycling numbers of random regular graphs. For a random cubic graph G of order n, we prove that (G) n/4 1/ 2 holds asymptotically almost surely. This is the result of executing a greedy algorithm for decycling G making use of a randomly chosen Hamilton cycle. For a general random d-regular graph G of order n, where d 4, we prove that (G)/n can be bounded below and above asymptotically almost surely by certain constants b(d) and B(d), depending solely on d, which are determined by solving, respectively, an algebraic equation and a system of differential equations. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 397–413, 2002
منابع مشابه
The decycling number of graphs
For a graph G and S ⊂ V (G), if G−S is acyclic, then S is said to be a decycling set ofG. The size of a smallest decycling set ofG is called the decycling number of G. The purpose of this paper is a comprehensive review of recent results and several open problems on this graph parameter. Results to be reviewed include recent work on decycling numbers of cubes, grids and snakes(?). A structural ...
متن کاملDecycling sets in certain cartesian product graphs with one factor complete
A decycling set in a graph G is a set D of vertices such that G − D is acyclic. The decycling number of G, φ(G), is the cardinality of a smallest decycling set in G. We obtain sharp bounds on the value of the cartesian product φ(G Kr) when r ≥ 3 and prove that when G belongs to one of several well-known families of graphs, including bipartite graphs and graphs of maximum degree 3, then φ(G K3) ...
متن کاملDecycling Number of Circular Graphs∗
The lower and upper bounds on the decycling number of circular graph C(n,k) where k ≤ ⌊ n 2⌋ of order n are obtained. The explicit expressions of that of some classes of graphs are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 21 شماره
صفحات -
تاریخ انتشار 2002